package com.yequan.leetcode.sort;

/**
 * @author yequan
 * @date 2021/10/21 00:00
 **/
public class MergeSort {

    public int[] sortArray(int[] nums) {
        mergeSort(nums,0,nums.length-1);
        return nums;
    }

    private void mergeSort(int[] nums, int left, int right) {
        if (left<right){
            int mid = left+((right-left)>>2);
        }
    }


}
